An Endless Hierarchy of Probabilities

نویسندگان

  • Jeanne Peijnenburg
  • David Atkinson
چکیده

According to radical probabilism, all factual claims are merely probabilistic in character. Throughout the centuries this view has been criticized on the grounds that it triggers an infinite regress: if every claim is probabilistic, then the proposition that something is probable is itself only probable, and so on. An endless hierarchy of probabilities seems to emerge and, as a result, the probability of the original proposition can never be determined. This criticism goes back as far as David Hume, and in the twentieth century it was raised also by statisticians such as Leonard J. Savage. Recently Nicholas Rescher ventured a similar critique of radical probabilism. In this paper it is argued that the criticism does not hold water, for an endless hierarchy of probability statements is no obstacle to attaching a definite probability value to the original proposition. Moreover, it is claimed that radical probabilism can reinforce some of Rescher’s own main claims.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomization in Learning Theory

We consider inductive inference learning of recursive computable functions Here the power of probabilistic algorithms increases as the probability of success decrease The pattern of this increase depends on the exact requirements about learning algorithm Typically the interval of success probabilities can be split into subintervals such that the power of algorithms with the success probabilitie...

متن کامل

A Cuckoo Filter Modification Inspired by Bloom Filter

Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...

متن کامل

Cyclic Inheritance Detection for Object-Oriented Database

Inheritance is the main theme of schema design for the object-oriented software and object-oriented database. This notion supports the class hierarchy design and captures the is-a relationship between a class and its subclass. It contributes to good properties of modularity, reusability and incremental design Cox86][Meyer88]. self-inheritance. Unfortunately, for a class hierarchy with cyclic in...

متن کامل

Information-Based Agents Model other Agents by Observing their Actions

An ‘information-based’ agent is proposed for competitive multi-issue negotiation, where speculation about an opponent’s motivation necessarily leads to an endless counter-speculation spiral of questionable value. Information-based agents model other agents by observing their behaviour and not by making assumptions concerning their motivations or internal reasoning. The integrity of these agents...

متن کامل

Exponential Models: Approximations for Probabilities

Welch & Peers (1963) used a root-information prior to obtain posterior probabilities for a scalar parameter exponential model and showed that these Bayes probabilities had the confidence property to second order asymptotically. An important undercurrent of this indicates that the constant information reparameterization provides location model structure, for which the confidence property ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011